منابع مشابه
Adding confidence to gene expression clustering.
It has been well established that gene expression data contain large amounts of random variation that affects both the analysis and the results of microarray experiments. Typically, microarray data are either tested for differential expression between conditions or grouped on the basis of profiles that are assessed temporally or across genetic or environmental conditions. While testing differen...
متن کاملAdding Knowledge Updates to 3APL
3APL is a widely known multi-agent programming language. However, when to be used in certain domains and environments, 3APL has some limitations related to its simplistic update operator that only allows for updates to the extensional part of the belief base and its lack of a language with both default and strong negation to enable the representation and reasoning about knowledge with the open ...
متن کاملAdding Context to Knowledge and Action Bases
Knowledge and Action Bases (KABs) have been recently proposed as a formal framework to capture the dynamics of systems which manipulate Description Logic (DL) Knowledge Bases (KBs) through action execution. In this work, we enrich the KAB setting with contextual information, making use of different context dimensions. On the one hand, context is determined by the environment using context-chang...
متن کاملKnowledge and Confidence of Emergency Clinicians in Managing Toxicological Presentations
Background: Acute poisonings are common presentations to emergency departments (EDs) worldwide and require rapid assessment. Consultant emergency physicians (EPs) faced with various toxicological presentations must initiate rapid investigations and empirical management. This study aimed to determine emergency department doctors’ level of knowledge and confidence in toxicological presentations, ...
متن کاملAdding Double Progressive Widening to Upper Confidence Trees to Cope with Uncertainty in Planning Problems
Current state of the art methods in energy policy planning only approximate the problem (Linear Programming on a finite sample of scenarios, Dynamic Programming on an approximation of the problem, etc). Monte-Carlo Tree Search (MCTS [3]) seems to be a potential candidate to converge to an exact solution of these problems ([2]). But how fast, and how do key parameters (double/simple progressive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Scholarship of Teaching and Learning
سال: 2014
ISSN: 1527-9316
DOI: 10.14434/josotl.v15i1.12761